Local spreading algorithms for autonomous robot systems
نویسندگان
چکیده
منابع مشابه
Local spreading algorithms for autonomous robot systems
This paper studies local algorithms for autonomous robot systems, namely, algorithms that use only information of the positions of a bounded number of their nearest neighbors. The paper focuses on the spreading problem. It defines measures for the quality of spreading, presents a local algorithm for the one-dimensional spreading problem, prove its convergence to the equally spaced configuration...
متن کاملLocal Algorithms for Autonomous Robot Systems
This paper studies local algorithms for autonomous robot systems, namely, algorithms that use only information of the positions of a bounded number of their nearest neighbors. The paper focuses on the spreading problem. It defines measures for the quality of spreading, presents a local algorithm for the one-dimensional spreading problem, prove its convergence to the equally spaced configuration...
متن کاملLocal distributed algorithms for multi-robot systems
The field of swarm robotics focuses on controlling large populations of simple robots to accomplish tasks more effectively than what is possible using a single robot. This thesis develops distributed algorithms tailored for multi-robot systems with large populations. Specifically we focus on local distributed algorithms since their performance depends primarily on local parameters on the system...
متن کاملLocal Algorithms for Autonomous
This paper studies local algorithms for autonomous robot systems, namely, algorithms that use only information of the positions of a bounded number of their nearest neighbors. The paper focuses on the spreading problem. It deenes measures for the quality of spreading, presents a local algorithm for the one-dimensional spreading problem, prove its convergence to the equally spaced connguration a...
متن کاملAutonomous Robot Navigation using Genetic Algorithms
In this paper is presented a navigation scheme, based on a genetic algorithm, for autonomous robot navigation. Potential fields are used to attract the robot by the goal position and reject it by the obstacles. In the scheme presented here obstacles are automatically detected by simulated sonar sensors. The configuration of the optimum potential field is determined by the genetic algorithm. Int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.02.007